Binary segmentation for matrix and vector operations
نویسندگان
چکیده
منابع مشابه
Trident: A Scalable Architecture for Scalar, Vector, and Matrix Operations
Within a few years it will be possible to integrate a billion transistors on a single chip. At this integration level, we propose using a high level ISA to express parallelism to hardware instead of using a huge transistor budget to dynamically extract it. Since the fundamental data structures for a wide variety of applications are scalar, vector, and matrix, our proposed Trident processor exte...
متن کاملSegmented Operations for Sparse Matrix Computation on Vector Multiprocessors
In this paper we present a new technique for sparse matrix multiplication on vector multiprocessors based on the efficient implementation of a segmented sum operation. We describe how the segmented sum can be implemented on vector multiprocessors such that it both fully vectorizes within each processor and parallelizes across processors. Because of our method’s insensitivity to relative row siz...
متن کاملAuto-tuning Dense Vector and Matrix-Vector Operations for Fermi GPUs
In this paper, we consider the automatic performance tuning of dense vector and matrix-vector operations on GPUs. Such operations form the backbone of level 1 and level 2 routines in the Basic Linear Algebra Subroutines (BLAS) library and are therefore of great importance in many scientific applications. As examples, we develop single-precision CUDA kernels for the euclidian norm (SNRM2) and th...
متن کاملBinary operations and groups
Example 1.3. The examples are almost too numerous to mention. For example, using +, we have (N,+), (Z,+), (Q,+), (R,+), (C,+), as well as vector space and matrix examples such as (Rn,+) or (Mn,m(R),+). Using subtraction, we have (Z,−), (Q,−), (R,−), (C,−), (Rn,−), (Mn,m(R),−), but not (N,−). For multiplication, we have (N, ·), (Z, ·), (Q, ·), (R, ·), (C, ·). If we define Q∗ = {a ∈ Q : a 6= 0}, ...
متن کاملBinary Operations
Let A be a set. A unary operation on A is a function from A into A. A binary operation on A is a function from [:A, A :] into A. We adopt the following convention: u is a unary operation on A, o, o′ are binary operations on A, and a, b, c, e, e1, e2 are elements of A. In this article we present several logical schemes. The scheme BinOpEx deals with a non empty set A and a ternary predicate P , ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90144-k